Longest common parameterized subsequences with fixed common substring

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest Common Parameterized Subsequences with Fixed Common Substring

In this paper we consider the problem of the longest common parameterized subsequence with fixed common substring (STR-IC-LCPS). In particular, we show that STR-IC-LCPS is NP-complete. We describe an approach to solve STR-IC-LCPS. This approach is based on an explicit reduction from the problem to the satisfiability problem.

متن کامل

Longest Common Subsequences

The length of a longest common subsequence (LLCS) of two or more strings is a useful measure of their similarity. The LLCS of a pair of strings is related to thèedit distance', or number of mu-tations/errors/editing steps required in passing from one string to the other. In this talk, we explore some of the combinatorial properties of the sub-and super-sequence relations, survey various algorit...

متن کامل

Longest Common Substring with Approximately k Mismatches

In the longest common substring problem we are given two strings of length n and must find a substring of maximal length that occurs in both strings. It is well-known that the problem can be solved in linear time, but the solution is not robust and can vary greatly when the input strings are changed even by one letter. To circumvent this, Leimeister and Morgenstern introduced the problem of the...

متن کامل

Longest Common Subsequences in Sets of Words

Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least nk + cn1−1/(t−k−2), for some c > 0 depending on k and t. This is sharp up to the value of c.

متن کامل

Computing the Number of Longest Common Subsequences

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematical Sciences

سال: 2013

ISSN: 1314-7552

DOI: 10.12988/ams.2013.13057